Separating bounded arithmetical theories by Herbrand consistency
نویسنده
چکیده
The problem of Π1−separating the hierarchy of bounded arithmetic has been studied in the paper. It is shown that the notion of Herbrand Consistency, in its full generality, cannot Π1−separate the theory I∆0 + ∧ j Ωj from I∆0; though it can Π1−separate I∆0 + Exp from I∆0. This extends a result of L. A. Ko lodziejczyk (2006), by showing the unprovability of the Herbrand Consistency of I∆0 in the theory I∆0 + ∧ j Ωj. vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv 2010 Mathematics Subject Classification: Primary 03F30, 03F25; Secondary 03F05, 03F40.
منابع مشابه
Herbrand Consistency of Some Arithmetical Theories
Gödel’s second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand consistency and bounded arithmetic, Fundamenta Mathematicae 171 (2002) 279–292]. In that paper, it was shown that one cannot always shrink the witness of a bou...
متن کاملHerbrand consistency of some finite fragments of bounded arithmetical theories
We formalize the notion of Herbrand Consistency in an appropriate way for bounded arithmetics, and show the existence of a finite fragment of I∆0 whose Herbrand Consistency is not provable in the thoery I∆0. We also show the existence of an I∆0−derivable Π1−sentence such that I∆0 cannot prove its Herbrand Consistency. Acknowledgements This research is partially supported by grant No 89030062 of...
متن کاملOn the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
Modifying the methods of Z. Adamowicz’s paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that ⋃ m Sm (the union of the bounded arithmetic theories Sm) does not prove the Herbrand consistency of the finitely axiomatizable theory Sn 3 . From the point of view of bounded arithmetic, the concept of consistency based on Herbrand’s ...
متن کاملTitle: Herbrand Consistency in Arithmetics with Bounded Induction
The language of arithmetical theories considered here is L = +, ×, ≤, 0, 1 in which the symbols are interpreted as usual in elementary mathematics. Robinson's arithmetic is denoted by Q; it is a finitely axiomatized basic theory of the function and predicate symbols in L. Peano's arithmetic PA is the first-order theory that extends Q by the induction schema for any L-formula ϕ(x): ϕ(0) & ∀x(ϕ(x...
متن کاملOn theories of bounded arithmetic for NC
We develop an arithmetical theory VNC ∗ and its variant VNC 1 ∗, corresponding to “slightly nonuniform” NC . Our theories sit betweenVNC 1 and VL, and allow evaluation of log-depth bounded fan-in circuits under limited conditions. Propositional translations of Σ0 (LVNC1∗)-formulas provable inVNC 1 ∗ admit L-uniform polynomial-size Frege proofs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 22 شماره
صفحات -
تاریخ انتشار 2012